Interchange graphs and the Hamiltonian cycle polytope
نویسندگان
چکیده
منابع مشابه
Cycle spectra of Hamiltonian graphs
We prove that every Hamiltonian graph with n vertices and m edges has cycles of at least √ 4 7(m − n) different lengths. The coefficient 4/7 cannot be increased above 1, since when m = n2/4 there are √ m − n + 1 cycle lengths in Kn/2,n/2. For general m and n there are examples having at most 2 ⌈
متن کاملHamiltonian Cycle Problem for Triangle Graphs
We show that the Hamiltonian cycle problem is NP-complete for a class of planar graphs named triangle graphs that are closely related to inner-triangulated graphs. We present a linear-time heuristic algorithm that nds a solution at most one-third longer than the optimum solution and use it to obtain a fast rendering algorithm on triangular meshes in computer graphics.
متن کاملHamiltonian Spider Intersection Graphs Are Cycle Extendable
A cycle C of length k is extendable if there is a cycle C′ of length k+1 with V (C) ⊂ V (C′). A graph G = (V,E) of order n is cycle extendable when every cycle C of length k < n is extendable. A chordal graph is a spider intersection graph if it admits an intersection representation which consists of subtrees of a sub-divided star (or spider). In 1990, Hendry conjectured that all hamiltonian ch...
متن کاملHamiltonian Cycle Problem on Distance-Hereditary Graphs
All graphs considered in this paper are finite and undirected, without loops or multiple edges. Let G = (V, E) be a graph. Throughout this paper, let m and n denote the numbers of edges and vertices of graph G, respectively. A connected graph is distance-hereditary if the distance between every two vertices in a connected induced subgraph is the same as that in the original graph. Distance-here...
متن کاملHamiltonian chordal graphs are not cycle extendible
In 1990, Hendry conjectured that every Hamiltonian chordal graph is cycle extendible; that is, the vertices of any non-Hamiltonian cycle are contained in a cycle of length one greater. We disprove this conjecture by constructing counterexamples on n vertices for any n ≥ 15. Furthermore, we show that there exist counterexamples where the ratio of the length of a non-extendible cycle to the total...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1998
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)00086-3